Parallel lossless image compression using Huffman and arithmetic coding

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Lossless Image Compression and Decompression Using Huffman Coding

This paper propose a novel Image compression based on the Huffman encoding and decoding technique. Image files contain some redundant and inappropriate information. Image compression addresses the problem of reducing the amount of data required to represent an image. Huffman encoding and decoding is very easy to implement and it reduce the complexity of memory. Major goal of this paper is to pr...

متن کامل

New Methods for Lossless Image Compression Using Arithmetic Coding

Lossless image compression presents a unique set of challenges. Considerable research has already been done on lossless text compression [1,2,3,4,5]; all good methods found to date involve some form of moderately high-order exact string matching. However, this work cannot easily be carried over to lossless image compression, for two reasons: First, images are two-dimensional, so the contexts ar...

متن کامل

Lossless Image Compression Using Data Folding Followed By Arithmetic Coding

The paper presents a lossless image compression technique using the hybridization of two different entropy coding techniques. Initially data folding technique has been applied to the image. A row folding is applied on the image matrix followed by a column folding. Multiple iterations of this process is applied on the image. After completing the data folding process another entropy coding techni...

متن کامل

Lossless Grey-scale Image Compression using Source Symbols Reduction and Huffman Coding

Usage of Image has been increasing and used in many applications. Image compression plays vital role in saving storage space and saving time while sending images over network. A new compression technique proposed to achieve more compression ratio by reducing number of source symbols. The source symbols are reduced by applying source symbols reduction and further the Huffman coding is applied to...

متن کامل

Huffman Based LZW Lossless Image Compression Using Retinex Algorithm

Image compression is an application of data compression that encodes the original image with few bits. The objective of image compression is to reduce irrelevance and redundancy of the image data in order to be able to store or transmit data in an efficient form. So image compression can reduce the transmit time over the network and increase the speed of transmission. In Lossless image compress...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Information Processing Letters

سال: 1996

ISSN: 0020-0190

DOI: 10.1016/0020-0190(96)00090-7